NETWORK MODEL OF "T" LANGUAGE BASED ON COLOURED SAFE HIERARCHICAL RECURSIVE PETRI NETS

Pashchenko Dmitriy Vladimirovich, Doctor of engineering sciences, professor, head of sub-department of computer engineering, Penza State University (40 Krasnaya street, Penza, Russia), dmitry.pashchenko@gmail.com
Trokoz Dmitriy Anatol'evich, Candidate of engineering sciences, associate professor, sub-department of computer engineering, Penza State University (40 Krasnaya street, Penza, Russia), dmitriy.trokoz@gmail.com
Martyashin Georgiy Viktorovich, Master’s degree student, Penza State University (40 Krasnaya street, Penza, Russia), nowargore@gmail.com
Maksimova Kristina Stanislavovna, Master’s degree student, Penza State University (40 Krasnaya street, Penza, Russia), maximovachristina@gmail.com
Bal'zannikova Elena Alekseevna, Student, Penza State University (40 Krasnaya street, Penza, Russia), elenabalzannikova@gmail.com

004.94

Background. The research object is the developed functional T language, used for development of distributed control system algorithms. The research subject is a way of representing the functional language in the form of a network model based on coloured safe recursive hierarchical Petri nets. The purpose of the work is to formally describe the T language in the form of a network model for its further use in design and presentation of parallel computing systems.
Materials and methods. The T language was formally described using a model of safe recursive hierarchical coloured Petri nets.
Results. The authors defined and described limitations of the T language. The article shows the features of introduction of the language in the form of a network model based on Petri nets.
Conclusions. The authors propose a special kind of functional languages - the T language, intended to describe distributed automated control system algorithms. The proposed method of presentation of the language will make it possible to design a scheme, described in the T language, using the mathematical apparatus of Petri nets. Besides the presented method, the scheme can be described by methods of tensor calculus, as well as translation methods of obtained network models transformation.

Petri nets, T language, recursion, lazy evaluation, tensors.

1. Trokoz D. A., Bal'zannikova E. A., Martyashin G. V. Informatsionnye tekhnologii v nauke i obrazovanii. Problemy i perspektivy: sb. nauch. st. II ezhegodnoy mezhvuz. stud. nauch.‐prak. konf. [Information technologies in science and education. Problems and prospects: proceedings of II Annual interuniversity student scientific and practical conference]. Penza: Izd-vo PGU, 2015, pp. 90–93.
2. Pashchenko D. V., Bal'zannikova E. A., Trokoz D. A. Novye informatsionnye tekhnologii i sistemy: tr. XI Mezhdunar. nauch.-tekhn. konf. [New information technologies and systems: proceedings of XI Intenrational scientific and technical conference]. Penza: Izd-vo PGU, 2014, pp. 54–57.
3. Kulagin V. P. Perspektivy nauki i obrazovaniya [Prospects of science and education]. 2013, no. 6.
4. Kulagin V. P. Informatsionnye tekhnologii [Information technologies]. 2015, vol. 21, no. 2, pp. 84–94.
5. Pashchenko D. V., Trokoz D. A. Izvestiya vysshikh uchebnykh zavedeniy. Povolzhskiy region. Tekhnicheskie nauki [University proceedings. Volga region. Engineering sciences]. 2011, no. 3 (19), pp. 56–64.
6. Paul E. Black Tail recursion. Dictionary of Algorithms and Data Structures [online]. U.S. National Institute of Standards and Technology, 2008, 14 August.